667A - Pouring Rain - CodeForces Solution

// Problem: A. Pouring Rain
// Contest: Codeforces - Codeforces Round #349 (Div. 2)
// URL: https://codeforces.com/contest/667/problem/A
// Memory Limit: 256 MB
// Time Limit: 1000 ms

/* 
     
     #WTFyouhere
                    ♕ABHINAV♕
     
        HUSTLE KARO BHASAD NHI..... 
          
                             
*/

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
const unsigned int M = 1000000007;
//►►►►►►►►►►►►►►►►►►►►(⊙⊙)(☉_☉)(⊙⊙)►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►
ll power(ll a, ll b, ll m = M) {a %= m;ll res = 1;while (b > 0) {
if (b & 1)res = res * a % m;a = a * a % m;b >>= 1;}return res;}
ll gcd(ll x, ll y) {return (x ? gcd(y % x, x) : y);}
ll inv(ll n, ll m = M) {return power(n, m - 2, m);}
ll lcm(ll x, ll y) {return x / gcd(x, y) * y;}
ll nextgreaterelement(ll n) {auto digits = to_string(n);
next_permutation(begin(digits), end(digits));auto res = stoll(digits);return res;}
vector<int> factorize(int n) {vector<int> ans;for (int i = 2; i * i <= n; ++i) {
while (n % i == 0) {ans.push_back(i);n /= i;}}if (n != 1) {ans.push_back(n);}
for(int i=0;i<ans.size();i++)cout<<ans[i]<<" ";}
ll near_pow(ll q){ll ans = (ll)log2(q);return pow(2,ans);}
long long ceil(long long p, long long q) {if(p % q == 0) return (p / q);return (p / q) + 1;}
//►►►►►►►►►►►►►►►►►►►(⊙⊙)(☉_☉)(⊙⊙)►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►►


void reply()
{
    ll t;
    cin>>t;
    while(t--)
    {
                        
                              
    }
    
}


int main() {
	// your code goes here
	//reply();
	double d,h,v,e;
    cin>>d>>h>>v>>e;
    double pi=3.14159265356;
    double tmp;
    double r=d/2;
    double s=pi*r*r;
    tmp=v/s;
    double res=e-tmp;
    if(res>0) cout << "NO" << endl;
    else
    { cout << "YES"<<endl;
    cout<<fixed<<setprecision(15)<<-h/res<<endl;
    }
	
	
	
}